function qiu(n,k1,k2,arr1) {
    var arr=[]
    for (let i = 0; i < n; i++) {
        if ((arr1[i] % k1 == 0)&& (arr1[i]%k2!=0)) {
            arr.push(arr1[i])  
        }
    }
    var sum=0
    for (let i = 0; i < arr.length; i++) {
        if(arr[i]>0){
            sum+=arr[i]
        }
    }
    console.log(sum);
    var ss=0
    for (let i = 0; i < arr.length; i++) {
        for (let j = 0; j < arr.length; j++) {
            ss+=j
        }
    }
    console.log(ss);
}
qiu(5,3,4,[6,8,-2,-5,2])